A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems

Dynamic optimization problems challenge traditional evolutionary algorithms seriously since they, once converged, cannot adapt quickly to environmental changes. This paper investigates the application of memetic algorithms, a class of hybrid evolutionary algorithms, for dynamic optimization problems. An adaptive hill climbing method is proposed as the local search technique in the framework of memetic algorithms, which combines the features of greedy crossover-based hill climbing and steepest mutation-based hill climbing. In order to address the convergence problem, twodiversitymaintainingmethods, called adaptive dualmapping and triggered random immigrants, respectively, are also introduced into the proposed memetic algorithm for dynamic optimization problems. Based on a series of dynamic problems generated from several stationary benchmark problems, experiments are carried out to investigate the performance of the proposed memetic algorithm in comparison with some peer evolutionary algorithms. The experimental results show the efficiency of the proposed memetic algorithm in dynamic environments. H. Wang (B) · D. Wang School of Information Science and Engineering, Northeastern University, Shenyang 110004, People’s Republic of China e-mail: [email protected] D. Wang e-mail: [email protected] S. Yang Department of Computer Science, University of Leicester, University Road, Leicester LE1 7RH, UK e-mail: [email protected]